The Size-ramsey Number
نویسنده
چکیده
The size-Ramsey number of a graph G is the smallest number of edges in a graph Γ with the Ramsey property for G, that is, with the property that any colouring of the edges of Γ with two colours (say) contains a monochromatic copy of G. The study of size-Ramsey numbers was proposed by Erdős, Faudree, Rousseau, and Schelp in 1978, when they investigated the size-Ramsey number of certain classes of graphs and, among others, raised some questions concerning the size-Ramsey number of paths. In this talk, we shall survey some results that have been discovered since, focusing on a couple of recent results obtained by the study of Ramsey properties of fairly sparse random graphs by means of the regularity lemma. We give some details below.
منابع مشابه
Zarankiewicz Numbers and Bipartite Ramsey Numbers
The Zarankiewicz number z(b; s) is the maximum size of a subgraph of Kb,b which does not contain Ks,s as a subgraph. The two-color bipartite Ramsey number b(s, t) is the smallest integer b such that any coloring of the edges of Kb,b with two colors contains a Ks,s in the rst color or a Kt,t in the second color.In this work, we design and exploit a computational method for bounding and computing...
متن کاملRestricted size Ramsey number for path of order three versus graph of order five
Let G and H be simple graphs. The Ramsey number r(G,H) for a pair of graphs G and H is the smallest number r such that any red-blue coloring of the edges of Kr contains a red subgraph G or a blue subgraph H . The size Ramsey number r̂(G,H) for a pair of graphs G and H is the smallest number r̂ such that there exists a graph F with size r̂ satisfying the property that any red-blue coloring of the e...
متن کاملOn the Size-Ramsey Number of Hypergraphs
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we cons...
متن کاملThe size Ramsey number of a directed path
Given a graph H, the size Ramsey number re(H, q) is the minimal number m for which there is a graph G with m edges such that every q-coloring of G contains a monochromatic copy of H. We study the size Ramsey number of the directed path of length n in oriented graphs, where no antiparallel edges are allowed. We give nearly tight bounds for every fixed number of colors, showing that for every q ≥...
متن کاملSize Ramsey results for paths versus stars
A general upper bound for the size Ramsey number f(Ps , KI,t) matching the exact value for s ::; 7 and t sufficiently large is presented. Moreover, the remaining unknown values of the size Ramsey number for pairs of forests of order at most five are determined.
متن کامل